On Connected Component Decompositions of Quandles

Connected Quandles and Transitive Groups

We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and present new proofs concerning connected quandles of order p and 2p. We also present a new characterization of connected quandles that are affine.

Connected Component Based Word Spotting on Persian Handwritten image documents

Word spotting is to make searchable unindexed image documents by locating word/words in a doc-ument image, given a query word. This problem is challenging, mainly due to the large numberof word classes with very small inter-class and substantial intra-class distances. In this paper, asegmentation-based word spotting method is presented for multi-writer Persian handwritten doc-...

Tree-like Decompositions of Simply Connected Domains

We show that any simply connected rectifiable domain Ω can be decomposed into Lipschitz crescents using only crosscuts of the domain and using total length bounded by a multiple of the length of ∂Ω. In particular, this gives a new proof of a theorem of Peter Jones that such a domain can be decomposed into Lipschitz disks. 1991 Mathematics Subject Classification. Primary: 68U05 Secondary: 26B15,...

Chain Decompositions of 4-Connected Graphs

In this paper we give a decomposition of a 4-connected graph G into nonseparating chains, which is similar to an ear decomposition of a 2-connected graph. We also give an O(|V (G)||E(G)|) algorithm that constructs such a decomposition. In applications, the asymptotic performance can often be improved to O(|V (G)|). This decomposition will be used to find four independent spanning trees in a 4co...

On 4-connected graphs without even cycle decompositions